Non-binary universal tree-based networks

نویسندگان

چکیده

A tree-based network $N$ on $X$ is called universal if every phylogenetic tree a base for $N$. Recently, binary networks have attracted great attention in the literature and their existence has been analyzed various studies. In this note, we extend analysis to non-binary show that there exist both rooted an unrooted with $n$ leaves all positive integers $n$.

برای دانلود رایگان متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

The universal homogeneous binary tree

A partial order is called semilinear iff the upper bounds of each element are linearly ordered and any two elements have a common upper bound. There exists, up to isomorphism, a unique countable semilinear order which is dense, unbounded, binary branching, and without joins, which we denote by (S2;≤). We study the reducts of (S2;≤), that is, the relational structures with domain S2, all of whos...

متن کامل

On the existence of infinitely many universal tree-based networks.

A tree-based network on a set X of n leaves is said to be universal if any rooted binary phylogenetic tree on X can be its base tree. Francis and Steel showed that there is a universal tree-based network on X in the case of n = 3, and asked whether such a network exists in general. We settle this problem by proving that there are infinitely many universal tree-based networks for any n>1.

متن کامل

SPR-based Tree Reconciliation: Non-binary Trees and Multiple Solutions

The SPR (subtree prune and regraft) operation is used as the basis for reconciling incongruent phylo-genetic trees, particularly for detecting and analyzing non-treelike evolutionary histories such as horizontal gene transfer, hybrid speciation, and recombination. The SPR-based tree reconciliation problem has been shown to be NP-hard, and several efficient heuristics have been designed to solve...

متن کامل

Binary Classification by SVM Based Tree Type Neural Networks

A technique for building a multilayer perceptron classifier network is presented. Initially, a single perceptron tries to correctly classify as many samples as possible. Misclassified samples are taken care of by adding as bias the output of upto two neurons to the parent neuron. The final classification boundary between the two disjoint half spaces at the output of the parent neuron is determi...

متن کامل

The mQp Tree: A Multi-Dimensional Access Method based on a Non-Binary Tree

Many applications require data base systems with the capability to manage large amounts of data and to answer complex queries, especially those with several attributes, such as range queries and more particularly, spatial and temporal queries. Consequently, new access methods, with good performance for these types of operations associated with medium-high dimensionality, are needed. From this p...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Journal of Graph Algorithms and Applications

سال: 2022

ISSN: ['1526-1719']

DOI: https://doi.org/10.7155/jgaa.00583